package DynamicProgramming;
/*
 * 编辑距离
 */
public class lc72 {

        public int minDistance(String word1, String word2) {
            char[] w1 = word1.toCharArray();
            char[] w2 = word2.toCharArray();
            int len1 = w1.length;
            int len2 = w2.length;
            int[][] dp = new int[len1 + 1][len2 + 1];
            for (int i = 1; i < len1 + 1; i++) {
                dp[i][0] = i;
            }
            for (int i = 1; i < len2 + 1; i++) {
                dp[0][i] = i;
            }
            for (int i = 1; i <= len1; i++) {
                for (int j = 1; j <= len2; j++){
                    if (w1[i - 1] == w2[j - 1]) {
                        dp[i][j] = dp[i - 1][j - 1];
                    } else {
                        dp[i][j] = Math.min(dp[i - 1][j] + 1, Math.min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1));
                    }
                }
            }
            return dp[len1][len2];
        }
}
